Search for: All records

In highly and fully automated vehicles (AV), drivers could divert their attention to non-driving-related activities. Drivers may also take over AVs if they do not trust the way AVs drive in specific driving scenarios. Existing models have been developed to predict drivers’ takeover performance in responding to takeover requests initiated by AVs in semi-AVs. However, few models predicted driver-initiated takeover behavior in highly and fully AVs. The present study develops an attention-based multiple-input Convolutional Neural Network (CNN) to predict drivers’ takeover intention in fully AVs. The results indicated that the developed model successfully predicted takeover intentions of drivers with a precision of 0.982 and an F1-Score of.989, which were found to be substantially higher than other machine learning algorithms. The developed CNN model could be applied in improving the driving algorithms of the AV by considering drivers’ driving styles to reduce drivers’ unnecessary takeover behaviors. 

This paper focuses on a newly challenging setting in hard-label adversarial attacks on text data by taking the budget information into account. Although existing approaches can successfully generate adversarial examples in the hard-label setting, they follow an ideal assumption that the victim model does not restrict the number of queries. However, in real-world applications the query budget is usually tight or limited. Moreover, existing hard-label adversarial attack techniques use the genetic algorithm to optimize discrete text data by maintaining a number of adversarial candidates during optimization, which can lead to the problem of generating low-quality adversarial examples in the tight-budget setting. To solve this problem, in this paper, we propose a new method named TextHoaxer by formulating the budgeted hard-label adversarial attack task on text data as a gradient-based optimization problem of perturbation matrix in the continuous word embedding space. Compared with the genetic algorithm-based optimization, our solution only uses a single initialized adversarial example as the adversarial candidate for optimization, which significantly reduces the number of queries. The optimization is guided by a new objective function consisting of three terms, i.e., semantic similarity term, pair-wise perturbation constraint, and sparsity constraint. Semantic similarity term and pair-wise perturbation constraint can ensure the high semantic similarity of adversarial examples from both comprehensive text-level and individual word-level, while the sparsity constraint explicitly restricts the number of perturbed words, which is also helpful for enhancing the quality of generated text. We conduct extensive experiments on eight text datasets against three representative natural language models, and experimental results show that TextHoaxer can generate high-quality adversarial examples with higher semantic similarity and lower perturbation rate under the tight-budget setting.